## Uses of Class
oracle.pgx.api.PgxVertex

- Packages that use PgxVertex
  Package | Description
  --- | ---
  oracle.pgx.api | This package contains the Java APIs of PGX.

- - ### Uses of PgxVertex in oracle.pgx.api

    Methods in oracle.pgx.api that return PgxVertex
    Modifier and Type | Method and Description
    --- | ---
    `PgxVertex<ID>` | PgxPath.`getDestination()` Gets the destination vertex.
    `PgxVertex<ID>` | PgxPath.`getSource()` Gets the source vertex.
    `PgxVertex<ID>` | AllPaths.`getSource()` Gets the source vertex
    `<ID extends Comparable<ID>> PgxVertex<ID>` | PgxGraph.`getVertex(ID id)` Gets a `PgxVertex` of this graph by ID.
    `<ID extends Comparable<ID>> PgxVertex<ID>` | PgxGraph.`pickRandomVertex()` Blocking version of `PgxGraph.pickRandomVertexAsync()`.

    Methods in oracle.pgx.api that return types with arguments of type PgxVertex
    Modifier and Type | Method and Description
    --- | ---
    `PgxPath.PathIterable<PgxVertex<ID>>` | PgxPath.`getVertices()` Gets the vertices of this path.
    `<ID extends Comparable<ID>> PgxFuture<PgxVertex<ID>>` | PgxGraph.`pickRandomVertexAsync()` Picks a random vertex in the graph.

    Methods in oracle.pgx.api with parameters of type PgxVertex
    Modifier and Type | Method and Description
    --- | ---
    `<ID extends Comparable<ID>> VertexProperty<ID,Double>` | Analyst.`approximateVertexBetweennessCentralityFromSeeds(PgxGraph graph, PgxVertex<ID>... seeds)` Blocking version of `#approximateVertexBetweennessCentralityFromSeedsAsync()`.
    `<ID extends Comparable<ID>> PgxFuture<VertexProperty<ID,Double>>` | Analyst.`approximateVertexBetweennessCentralityFromSeedsAsync(PgxGraph graph, PgxVertex<ID>... seeds)` Approximate vertex betweenness centrality (without considering edge length).
    `int` | PgxVertex.`compareTo(PgxVertex<ID> o)`
    `<ID extends Comparable<ID>> AllPaths<ID>` | PgxGraph.`createAllPaths(PgxVertex<ID> src, EdgeProperty<Double> cost, VertexProperty<ID,PgxVertex<ID>> parent, VertexProperty<ID,PgxEdge> parentEdge)` Blocking version of `#createAllPathsAsync()`.
    `<ID extends Comparable<ID>> PgxFuture<AllPaths<ID>>` | PgxGraph.`createAllPathsAsync(PgxVertex<ID> src, EdgeProperty<Double> cost, VertexProperty<ID,PgxVertex<ID>> parent, VertexProperty<ID,PgxEdge> parentEdge)` Creates a `AllPaths` object representing all the shortest paths from a single source to all the possible destinations (shortest regarding the given edge costs).
    `<ID extends Comparable<ID>> PgxPath<ID>` | PgxGraph.`createPath(PgxVertex<ID> src, PgxVertex<ID> dst, EdgeProperty<Double> cost, VertexProperty<ID,PgxVertex<ID>> parent, VertexProperty<ID,PgxEdge> parentEdge)` Blocking version of `#createPathAsync()`.
    `<ID extends Comparable<ID>> PgxPath<ID>` | PgxGraph.`createPath(PgxVertex<ID> src, PgxVertex<ID> dst, EdgeProperty<Double> cost, VertexProperty<ID,PgxVertex<ID>> parent, VertexProperty<ID,PgxEdge> parentEdge)` Blocking version of `#createPathAsync()`.
    `<ID extends Comparable<ID>> PgxFuture<PgxPath<ID>>` | PgxGraph.`createPathAsync(PgxVertex<ID> src, PgxVertex<ID> dst, EdgeProperty<Double> cost, VertexProperty<ID,PgxVertex<ID>> parent, VertexProperty<ID,PgxEdge> parentEdge)` Creates a `PgxPath` object representing the shortest path from one source to one destination (shortest regarding the given edge costs).
    `<ID extends Comparable<ID>> PgxFuture<PgxPath<ID>>` | PgxGraph.`createPathAsync(PgxVertex<ID> src, PgxVertex<ID> dst, EdgeProperty<Double> cost, VertexProperty<ID,PgxVertex<ID>> parent, VertexProperty<ID,PgxEdge> parentEdge)` Creates a `PgxPath` object representing the shortest path from one source to one destination (shortest regarding the given edge costs).
    `<ID extends Comparable<ID>> AllPaths<ID>` | Analyst.`fattestPath(PgxGraph graph, PgxVertex<ID> root, EdgeProperty<Double> capacity)` Blocking version of `#fattestPathAsync()`.
    `<ID extends Comparable<ID>> PgxFuture<AllPaths<ID>>` | Analyst.`fattestPathAsync(PgxGraph graph, PgxVertex<ID> root, EdgeProperty<Double> capacity)` Fattest Tree Algorithm - Computes the fattest path from a source vertex to all vertices in the graph.
    `VertexCollection<ID>` | Partition.`getPartitionByVertex(PgxVertex<ID> vertex)`
    `int` | Partition.`getPartitionIndexOfVertex(PgxVertex<ID> vertex)`
    `PgxPath<ID>` | AllPaths.`getPath(PgxVertex<ID> destination)` Gets the path.
    `<ID extends Comparable<ID>> VertexProperty<ID,Double>` | Analyst.`personalizedPagerank(PgxGraph graph, PgxVertex<ID> v, double e, double d, int max)` Blocking version of `Analyst.personalizedPagerankAsync(PgxGraph, PgxVertex, double, double, int)`.
    `<ID extends Comparable<ID>> PgxFuture<VertexProperty<ID,Double>>` | Analyst.`personalizedPagerankAsync(PgxGraph graph, PgxVertex<ID> v, double e, double d, int max)` Personalized pagerank (random walk with restart) evaluates relative importance of vertices in a graph with respect to a given vertex v.
    `<ID extends Comparable<ID>> AllPaths<ID>` | Analyst.`shortestPathBellmanFord(PgxGraph graph, PgxVertex<ID> src, EdgeProperty<Double> cost)` Blocking version of `#shortestPathBellmanFordAsync()`.
    `<ID extends Comparable<ID>> PgxFuture<AllPaths<ID>>` | Analyst.`shortestPathBellmanFordAsync(PgxGraph graph, PgxVertex<ID> src, EdgeProperty<Double> cost)` Compute single source shortest paths using Bellman & Ford algorithm time complexity: O(E * D) with E = number of edges, D = number edges in the shortest length
    `<ID extends Comparable<ID>> AllPaths<ID>` | Analyst.`shortestPathBellmanFordReverse(PgxGraph graph, PgxVertex<ID> src, EdgeProperty<Double> cost)` Blocking version of `#shortestPathBellmanFordReverseAsync()`.
    `<ID extends Comparable<ID>> PgxFuture<AllPaths<ID>>` | Analyst.`shortestPathBellmanFordReverseAsync(PgxGraph graph, PgxVertex<ID> src, EdgeProperty<Double> cost)` Compute reverse single source shortest paths using Bellman & Ford algorithm time complexity: O(E * D) with E = number of edges, D = number edges in the shortest length
    `<ID extends Comparable<ID>> PgxPath<ID>` | Analyst.`shortestPathDijkstra(PgxGraph graph, PgxVertex<ID> src, PgxVertex<ID> dst, EdgeProperty<Double> cost)` Blocking version of `#shortestPathDijkstraAsync()`.
    `<ID extends Comparable<ID>> PgxPath<ID>` | Analyst.`shortestPathDijkstra(PgxGraph graph, PgxVertex<ID> src, PgxVertex<ID> dst, EdgeProperty<Double> cost)` Blocking version of `#shortestPathDijkstraAsync()`.
    `<ID extends Comparable<ID>> PgxFuture<PgxPath<ID>>` | Analyst.`shortestPathDijkstraAsync(PgxGraph graph, PgxVertex<ID> src, PgxVertex<ID> dst, EdgeProperty<Double> cost)` Compute shortest path using Dijkstra's algorithm.
    `<ID extends Comparable<ID>> PgxFuture<PgxPath<ID>>` | Analyst.`shortestPathDijkstraAsync(PgxGraph graph, PgxVertex<ID> src, PgxVertex<ID> dst, EdgeProperty<Double> cost)` Compute shortest path using Dijkstra's algorithm.
    `<ID extends Comparable<ID>> PgxPath<ID>` | Analyst.`shortestPathDijkstraBidirectional(PgxGraph graph, PgxVertex<ID> src, PgxVertex<ID> dst, EdgeProperty<Double> cost)` Blocking version of `#shortestPathDijkstraBidirectionalAsync()`.
    `<ID extends Comparable<ID>> PgxPath<ID>` | Analyst.`shortestPathDijkstraBidirectional(PgxGraph graph, PgxVertex<ID> src, PgxVertex<ID> dst, EdgeProperty<Double> cost)` Blocking version of `#shortestPathDijkstraBidirectionalAsync()`.
    `<ID extends Comparable<ID>> PgxFuture<PgxPath<ID>>` | Analyst.`shortestPathDijkstraBidirectionalAsync(PgxGraph graph, PgxVertex<ID> src, PgxVertex<ID> dst, EdgeProperty<Double> cost)` Compute shortest path using a bi-directional Dijkstra variant.
    `<ID extends Comparable<ID>> PgxFuture<PgxPath<ID>>` | Analyst.`shortestPathDijkstraBidirectionalAsync(PgxGraph graph, PgxVertex<ID> src, PgxVertex<ID> dst, EdgeProperty<Double> cost)` Compute shortest path using a bi-directional Dijkstra variant.
    `<ID extends Comparable<ID>> PgxPath<ID>` | Analyst.`shortestPathFilteredDijkstra(PgxGraph graph, PgxVertex<ID> src, PgxVertex<ID> dst, EdgeProperty<Double> cost, GraphFilter filterExpr)` Blocking version of `#shortestPathFilteredDijkstraAsync()`.
    `<ID extends Comparable<ID>> PgxPath<ID>` | Analyst.`shortestPathFilteredDijkstra(PgxGraph graph, PgxVertex<ID> src, PgxVertex<ID> dst, EdgeProperty<Double> cost, GraphFilter filterExpr)` Blocking version of `#shortestPathFilteredDijkstraAsync()`.
    `<ID extends Comparable<ID>> PgxFuture<PgxPath<ID>>` | Analyst.`shortestPathFilteredDijkstraAsync(PgxGraph graph, PgxVertex<ID> src, PgxVertex<ID> dst, EdgeProperty<Double> cost, GraphFilter filterExpr)` Compute shortest path using Dijkstra's algorithm on a filtered graph The filter specified by the given filter expression is applied on each edge during traversal of the graph.
    `<ID extends Comparable<ID>> PgxFuture<PgxPath<ID>>` | Analyst.`shortestPathFilteredDijkstraAsync(PgxGraph graph, PgxVertex<ID> src, PgxVertex<ID> dst, EdgeProperty<Double> cost, GraphFilter filterExpr)` Compute shortest path using Dijkstra's algorithm on a filtered graph The filter specified by the given filter expression is applied on each edge during traversal of the graph.
    `<ID extends Comparable<ID>> PgxPath<ID>` | Analyst.`shortestPathFilteredDijkstraBidirectional(PgxGraph graph, PgxVertex<ID> src, PgxVertex<ID> dst, EdgeProperty<Double> cost, GraphFilter filterExpr)` Blocking version of `#shortestPathFilteredDijkstraBidirectionalAsync()`.
    `<ID extends Comparable<ID>> PgxPath<ID>` | Analyst.`shortestPathFilteredDijkstraBidirectional(PgxGraph graph, PgxVertex<ID> src, PgxVertex<ID> dst, EdgeProperty<Double> cost, GraphFilter filterExpr)` Blocking version of `#shortestPathFilteredDijkstraBidirectionalAsync()`.
    `<ID extends Comparable<ID>> PgxFuture<PgxPath<ID>>` | Analyst.`shortestPathFilteredDijkstraBidirectionalAsync(PgxGraph graph, PgxVertex<ID> src, PgxVertex<ID> dst, EdgeProperty<Double> cost, GraphFilter filterExpr)` Compute shortest path using a bi-directional Dijkstra variant on a filtered graph.
    `<ID extends Comparable<ID>> PgxFuture<PgxPath<ID>>` | Analyst.`shortestPathFilteredDijkstraBidirectionalAsync(PgxGraph graph, PgxVertex<ID> src, PgxVertex<ID> dst, EdgeProperty<Double> cost, GraphFilter filterExpr)` Compute shortest path using a bi-directional Dijkstra variant on a filtered graph.
    `<ID extends Comparable<ID>> AllPaths<ID>` | Analyst.`shortestPathHopDist(PgxGraph graph, PgxVertex<ID> src)` Blocking version of `#shortestPathHopDistAsync()`.
    `<ID extends Comparable<ID>> PgxFuture<AllPaths<ID>>` | Analyst.`shortestPathHopDistAsync(PgxGraph graph, PgxVertex<ID> src)` Compute hop-distance from given vertex to every other vertex time complexity: O(E * d) with E = number of edges, d = diameter of graph
    `<ID extends Comparable<ID>> AllPaths<ID>` | Analyst.`shortestPathHopDistReverse(PgxGraph graph, PgxVertex<ID> src)` Blocking version of `#shortestPathHopDistReverseAsync()`.
    `<ID extends Comparable<ID>> PgxFuture<AllPaths<ID>>` | Analyst.`shortestPathHopDistReverseAsync(PgxGraph graph, PgxVertex<ID> src)` Compute reverse hop-distance from given vertex to every other vertex time complexity: O(E * d) with E = number of edges, d = diameter of graph
    `<ID extends Comparable<ID>> Pair<VertexSequence<ID>,VertexSequence<ID>>` | Analyst.`whomToFollow(PgxGraph graph, PgxVertex<ID> vertex, int max)` Blocking version of `Analyst.whomToFollowAsync(PgxGraph, PgxVertex, int)`.
    `<ID extends Comparable<ID>> Pair<VertexSequence<ID>,VertexSequence<ID>>` | Analyst.`whomToFollow(PgxGraph graph, PgxVertex<ID> vertex, int max, int circleOfTrustSize, int randomWalkSteps, double randomWalkResetProbablitiy, double salsaDampingFactor, int salsaMaxIterations, double salsaMaxDiff)` Blocking version of `Analyst.whomToFollowAsync(PgxGraph, PgxVertex, int, int, int, double, double, int, double)`.
    `<ID extends Comparable<ID>> PgxFuture<Pair<VertexSequence<ID>,VertexSequence<ID>>>` | Analyst.`whomToFollowAsync(PgxGraph graph, PgxVertex<ID> vertex, int max)` Convenience method around `Analyst.whomToFollowAsync(PgxGraph, PgxVertex, int, int, int, double, double, int, double)` using circleOfTrustSize = 500 randomWalkSteps = 50000 randomWalkResetProbablitiy = 0.15 salsaDampingFactor = 0.85 salsaMaxIterations = 1000 salsaMaxDiff = 0.01
    `<ID extends Comparable<ID>> PgxFuture<Pair<VertexSequence<ID>,VertexSequence<ID>>>` | Analyst.`whomToFollowAsync(PgxGraph graph, PgxVertex<ID> vertex, int max, int circleOfTrustSize, int randomWalkSteps, double randomWalkResetProbablitiy, double salsaDampingFactor, int salsaMaxIterations, double salsaMaxDiff)` The Who to Follow recommendation algorithm by Twitter, Inc.

    Method parameters in oracle.pgx.api with type arguments of type PgxVertex
    Modifier and Type | Method and Description
    --- | ---
    `<ID extends Comparable<ID>> AllPaths<ID>` | PgxGraph.`createAllPaths(PgxVertex<ID> src, EdgeProperty<Double> cost, VertexProperty<ID,PgxVertex<ID>> parent, VertexProperty<ID,PgxEdge> parentEdge)` Blocking version of `#createAllPathsAsync()`.
    `<ID extends Comparable<ID>> PgxFuture<AllPaths<ID>>` | PgxGraph.`createAllPathsAsync(PgxVertex<ID> src, EdgeProperty<Double> cost, VertexProperty<ID,PgxVertex<ID>> parent, VertexProperty<ID,PgxEdge> parentEdge)` Creates a `AllPaths` object representing all the shortest paths from a single source to all the possible destinations (shortest regarding the given edge costs).
    `<ID extends Comparable<ID>> PgxPath<ID>` | PgxGraph.`createPath(PgxVertex<ID> src, PgxVertex<ID> dst, EdgeProperty<Double> cost, VertexProperty<ID,PgxVertex<ID>> parent, VertexProperty<ID,PgxEdge> parentEdge)` Blocking version of `#createPathAsync()`.
    `<ID extends Comparable<ID>> PgxFuture<PgxPath<ID>>` | PgxGraph.`createPathAsync(PgxVertex<ID> src, PgxVertex<ID> dst, EdgeProperty<Double> cost, VertexProperty<ID,PgxVertex<ID>> parent, VertexProperty<ID,PgxEdge> parentEdge)` Creates a `PgxPath` object representing the shortest path from one source to one destination (shortest regarding the given edge costs).
    `<V extends Comparable<V>> void` | VertexSet.`extractTopKFromMap(PgxMap<PgxVertex<ID>,V> map, int k)` Blocking version of `#extractTopKFromMapAsync()`.
    `<V extends Comparable<V>> PgxFuture<Void>` | VertexSet.`extractTopKFromMapAsync(PgxMap<PgxVertex<ID>,V> map, int k)` Extracts the top k keys from the given map and puts them into this collection.

Copyright © 2015. All rights reserved.